Health risks of irrigation with untreated urban wastewater in the southern Punjab, Pakistan

Irrigation water / Water quality / Water reuse / Waste waters / Risks / Public health / Diseases / Farmers / Pakistan / Southern Punjab / Haroonabad

Epistemic Quantified Boolean Logic

This paper is aimed as a contribution to the use of formal modal languages in Artificial Intelligence. We introduce a multi-modal version of Second-order Propositional Modal Logic (SOPML), an extension of modal logic with propositional quantification, and illustrate its usefulness as a specification language for knowledge representation as well as temporal and spatial reasoning. Then, we define novel notions of (bi)simulation and prove that these preserve the interpretation of SOPML formulas. Finally, we apply these results to assess the expressive power of SOPML

A Semantical Analysis of Second-Order Propositional Modal Logic

International audienceThis paper is aimed as a contribution to the use of formal modal languages in Artificial Intelligence. We introduce a multi-modal version of Second-order Propositional Modal Logic (SOPML), an extension of modal logic with propositional quantification, and illustrate its usefulness as a specification language for knowledge representation as well as temporal and spatial reasoning. Then, we define novel notions of (bi)simulation and prove that these preserve the interpretation of SOPML formulas. Finally, we apply these results to assess the expressive power of SOPML

The undecidability of arbitrary arrow update logic

Arbitrary Arrow Update Logic is a dynamic modal logic with a modality to quantify over arrow updates. Some properties of this logic have already been established, but until now it remained an open question whether the logic's satisfiability problem is decidable. Here, we show by a reduction of the tiling problem that the satisfiability problem of Arbitrary Arrow Update Logic is co-RE hard, and therefore undecidable

Reasoning about Choice

We present a logic for reasoning about choice. Choice ctl (c-ctl) extends the well-known branching-time temporal logic ctl with choice modalities, " ◊ " and "□". An example c-ctl formula is ◊ AF happy, asserting that there exists a choice that will lead to happiness. c-ctl is related to both stit logics and temporal cooperation logics such as atl, but has a much simpler and (we argue) more intuitive syntax and semantics. After presenting the logic, we investigate the properties of the language. We characterise the complexity of the c-ctl model checking problem, investigate some validities, and propose multi-agent extensions to the logic

Malaria in Sri Lanka: Current knowledge on transmission and control

Malaria / Disease vectors / Waterborne diseases / Environmental effects / Public health / Economic impact / Social impact / Sri Lanka